/************************************************************************************
 * Given two binary trees, write a function to check if they are equal or not.
 * Two binary trees are considered equal if they are structurally identical and 
 * the nodes have the same value.
 ************************************************************************************
 * Definition for a binary tree node.
 * struct TreeNode 
 * {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 ************************************************************************************/
#include <iostream>
using namespace std;

struct TreeNode
{
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

int main(void)
{
	return 0;
}

bool isSameTree(TreeNode* p, TreeNode* q)
{
	if (p == NULL && q == NULL)
	{
		return true;
	}
	if ((p == NULL && q != NULL) || (p != NULL && q == NULL))
	{
		return false;
	}
	if (p->val != q->val)
		return false;

	return  (isSameTree(p->left, q->left) && isSameTree(p->right, q->right));
}